Note on “Parallel Machine Scheduling with Batch Setup Times”
نویسندگان
چکیده
منابع مشابه
Parallel machine scheduling with precedence constraints and setup times
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions and specific lower bounds are proposed. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from ...
متن کاملBatch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
The recent survey paper “A Survey on Scheduling Problems with Setup Times and Costs” 1 , classifies batch scheduling problems into those with batching and nonbatching considerations, with sequence-independent and sequence-dependent setup times, and according to the machine environment and the objective function. The survey contains approximately 300 references, a clear indication of the importa...
متن کاملParallel Machine Batch Scheduling
The problem of scheduling G groups of jobs on m unrelated parallel machines is considered. Each group consists of several identical jobs. Implicit in a schedule is a partition of a group into batches; all jobs of a batch are processed jointly. It is possible for diierent batches of the same group to be processed concurrently on diierent machines. However, at any time, a batch can be processed o...
متن کاملScheduling jobs on parallel machines with sequence-dependent setup times
The study considers the scheduling problem of identical parallel machines subject to minimization of the maximumcompletion time and the maximum tardiness expressed in a linear convex objective function. The maximum completiontime or makespan is the date when the last job to be completed leaves the system. The maximum tardiness is indicated bythe job that is completed with the lo...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1998
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.46.3.423